Abstract
Given a 2.5D terrain and a query point p on or above it, we want to find the triangles of terrain that are visible from p. We present an approximation algorithm to solve this problem. We implement the algorithm and test it on real data sets. The experimental results show that our approximate solution is very close to the exact solution and compared to the other similar works, the computational cost of our algorithm is lower. We analyze the computational complexity of the algorithm. We consider the visibility testing problem where the goal is to test whether a given triangle of the terrain is visible or not with respect to p. We present an algorithm for this problem and show that the average running time of this algorithm is the same as the running time of the case where we want to test the visibility between two query points p and q. We also propose a randomized algorithm for providing an estimate of the portion of the visible region of a terrain for a query point.
This is a preview of subscription content, log in via an institution to check access.
Similar content being viewed by others
References
Alipour S, Zarei A (2011) Visibility testing and counting. In: Proceedings of the 5th Joint International Frontiers in Algorithmics, and 7th International Conference on Algorithmic Aspects in Information and Management, Springer-Verlag, Berlin, Heidelberg, FAW-AAIM’11. http://dl.acm.org/citation.cfm?id=2021911.2021949, pp 343–351
Alipour S, Ghodsi M, Güdükbay U, Golkari M (2014) An approximation algorithm for computing the visibility region of a point on a terrain and visibility testing. In: Proceedings of the International Conference on Computer Vision Theory and Applications. VISAPP 2014. IEEE, Piscataway, New Jersey, pp 699–704
Alsadik B, Gerke M, Vosselman G (2014) Visibility analysis of point cloud in close range photogrammetry. ISPRS Annals of Photogrammetry, Remote Sensing and Spatial Information Sciences pp 9–16. doi:10.5194/isprsannals-II-5-9-2014
Ben-Moshe B, Carmi P, Katz MJ (2008) Approximating the visible region of a point on a terrain. Geoinformatica 12(1):21–36. doi:10.1007/s10707-006-0017-5
Cohen-Or D, Shaked A (1995) Visibility and dead-zones in digital terrain maps. Comput Graph Forum 14 (1):171–180. http://dblp.uni-trier.de/db/journals/cgf/cgf14.html#Cohen-OrS95
Cole R, Sharir M (1989) Visibility problems for polyhedral terrains. J Symb Comput 7 (1):11 – 30. doi:10.1016/S0747-7171(89)80003-3 10.1016/S0747-7171(89)80003-3. http://www.sciencedirect.com/science/article/pii/S0747717189800033 http://www.sciencedirect.com/science/article/pii/S0747717189800033
Devai F (1986) Quadratic bounds for hidden line elimination. In: Proceedings of the second annual symposium on Computational geometry, ACM, New York, NY, USA, SCG ’86. doi:10.1145/10515.10544, pp 269–275
Floriani LD, Magillo P (1994) Visibility algorithms on triangulated digital terrain models. Int J Geogr Inf Syst 8(1):13–41. doi:10.1080/02693799408901985
Floriani LD, Magillo P (1996) Representing the visibility structure of a polyhedral terrain through a horizon map. Int J Geogr Inf Syst 10(5):541–561. doi:10.1080/02693799608902096
Franklin WR, Ray CK, Shashank M (1994) Geometric algorithms for siting of air defense missile batteries. Battelle Inc., Columbus OH
Goodchild M, Lee J (1989) Coverage problems and visibility regions on topographic surfaces. Ann Oper Res 18(1):175–186. doi:10.1007/BF02097802
Stewart A (1998) Fast horizon computation at all points of a terrain with visibility and shading applications. IEEE Trans Vis Comput Graph 4(1):82–93. doi:10.1109/2945.675656
Acknowledgments
Grand Canyon Data obtained from the United States Geological Survey (USGS), with processing by Chad McCabe of the Microsoft Geography Product Unit.
Author information
Authors and Affiliations
Corresponding author
Rights and permissions
About this article
Cite this article
Alipour, S., Ghodsi, M., Güdükbay, U. et al. Approximation algorithms for visibility computation and testing over a terrain. Appl Geomat 9, 53–59 (2017). https://doi.org/10.1007/s12518-016-0180-9
Received:
Accepted:
Published:
Issue Date:
DOI: https://doi.org/10.1007/s12518-016-0180-9